Linear Transforms: From Math to Efficient Hardware
نویسندگان
چکیده
Introduction. Linear transforms (such as the discrete Fourier transform) are widely used building blocks in signal processing applications. The domain of linear transforms and their algorithms is well understood mathematically. In this work, we utilize this math-level knowledge to construct a formula driven domain specific high-level synthesis tool. This tool is able to generate efficient register transfer level designs from a mathematical description of the problem. The tool’s flexibility allows its generated designs to span a wide cost/performance tradeoff space.
منابع مشابه
Classical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملThe efficient computation of Fourier transforms on the symmetric group
This paper introduces new techniques for the efficient computation of Fourier transforms on symmetric groups and their homogeneous spaces. We replace the matrix multiplications in Clausen’s algorithm with sums indexed by combinatorial objects that generalize Young tableaux, and write the result in a form similar to Horner’s rule. The algorithm we obtain computes the Fourier transform of a funct...
متن کاملAn alternative transformation in ranking using l1-norm in data envelopment analysis
Jahanshahloo et al. (Appl Math Comput 153:215–224, 2004) propose a method for ranking extremely efficient decision making units (DMUs) in data envelopment analysis (DEA) using super-efficiency technique and l1-norm and they show that the presented method is able to eliminate the existing difficulties in some methods. This paper suggests an alternative transformation to convert the nonlinear mod...
متن کاملLinearized Bregman iterations for compressed sensing
Finding a solution of a linear equation Au = f with various minimization properties arises from many applications. One of such applications is compressed sensing, where an efficient and robust-to-noise algorithm to find a minimal `1 norm solution is needed. This means that the algorithm should be tailored for large scale and completely dense matrices A, while Au and A u can be computed by fast ...
متن کاملAnalysis of a class of nonlinear subdivision schemes and associated multiresolution transforms
This paper is devoted to the convergence and stability analysis of a class of nonlinear subdivision schemes and associated multi-resolution transforms. These schemes are defined as a perturbation of a linear subdivision scheme. Assuming a contractivity property, stability and convergence are derived. These results are then applied to various schemes such as uncentered interpolatory linear schem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008